Reinforced Adaptive Large Neighborhood Search
نویسندگان
چکیده
The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particularity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the current solution. Large Neighborhood Search has three parameters that must be specified (size of the fragment, search limit and fragment selection procedure). Its performances greatly depend on those parameters. Despite the success of the metaheuristic, no generic principle has emerged yet on how to choose the parameters. They are currently set either with domain dependent heuristics or chosen randomly. The objective of this ongoing work is to develop generic heuristics for adaptive selection of the parameters of Large Neighborhood Search. This paper proposes to use a Reinforcement Learning framework in order to adapt the heuristics during the search. Two heuristics are proposed to deal with the first two parameters of the metaheuristic. Three are proposed to adapt the last parameter. Preliminary computational results on the Car Sequencing problem are given. On this problem, only the adaptive selection of the first two parameters is effective.
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملConsidering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers
Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...
متن کاملLarge neighborhood search
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the l...
متن کاملA Robust Competitive Global Supply Chain Network Design under Disruption: The Case of Medical Device Industry
In this study, an optimization model is proposed to design a Global Supply Chain (GSC) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. Therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of Economic Cooperation Organization trade agreement (ECOTA) is...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کامل